Exact methods for the Oven Scheduling Problem

Abstract The Oven Scheduling Problem (OSP) is a new parallel batch scheduling problem that arises in the area of electronic component manufacturing. Jobs need to be scheduled one several ovens and may processed simultaneously if they have compatible requirements. jobs must respect constraints concerning eligibility availability ovens, release dates jobs, setup times between batches as well oven capacities. Running highly energy-intensive thus main objective, besides finishing on time, minimize cumulative processing time across all ovens. This objective distinguishes OSP from other problems which typically objectives related makespan, tardiness or lateness. We propose solve this NP-hard using exact techniques present two different modelling approaches, based positions another representative for batches. These models are formulated constraint programming (CP) integer linear (ILP) implemented both solver-independent modeling language MiniZinc interval variables CP Optimizer. An extensive experimental evaluation our solution methods performed diverse set instances. evaluate performance state-of-the-art solvers three variants function reflect real-life scenarios. show can find feasible solutions instances realistic size, many those being provably optimal nearly solutions.